The maximum flow problem of uncertain network
نویسندگان
چکیده
The maximum flow problem is one of the classic combinatorial optimization problems with many applications in electrical power systems, communication networks, computer networks and logistic networks. The goal of the problem is to find the maximum amount of flow from the source to the sink in a network. A network is called uncertain if the arc capacities of the network are uncertain variables. The main purpose of this paper is to solve the maximum flow in an uncertain network by under the framework of uncertainty theory. 2013 Elsevier Inc. All rights reserved.
منابع مشابه
On The Fractional Minimal Cost Flow Problem of a Belief Degree Based Uncertain Network
A fractional minimal cost flow problem under linear type belief degree based uncertainty is studied for the first time. This type of uncertainty is useful when no historical information of an uncertain event is available. The problem is crisped using an uncertain chance-constrained programming approach and its non-linear objective function is linearized by a variable changing approach. An illus...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملCooperative network flow problem with pricing decisions and allocation of benefits: A game theory approach
Several real problems in telecommunication, transportation, and distribution industries can be well analyzed by network flow models. In revenue management, pricing plays a primary role which increases the profit generated from a limited supply of assets. Pricing decision directly affects the amount of service or product demand. Hence, in traditional maximum flow problem, we assume that the dema...
متن کاملA Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملAn optimization model for management of empty containers in distribution network of a logistics company under uncertainty
In transportation via containers, unbalanced movement of loaded containers forces shipping companies to reposition empty containers. This study addresses the problem of empty container repositioning (ECR) in the distribution network of a European logistics company, where some restrictions impose decision making in an uncertain environment. The problem involves dispatching empty contain...
متن کاملThe maximum flow problem of uncertain random network
The maximum flow problem is one of the important problems of network optimization and covers a wide range of engineering and management applications. Different from the existing works, this paper investigates the maximum flow problem of an uncertain random network under the framework of chance theory. An model of uncertain random α-maximum flow problem is exhibited. And then, it is proved that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Sci.
دوره 265 شماره
صفحات -
تاریخ انتشار 2014